Lex M versus MCS-M

Lex M versus MCS-M

We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M called MCS-M, was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of triangulations, answering an open question mentioned by the authors of MCS-M.

Reports in Informatics Issn 0333-3590 Lex M versus Mcs-m Lex M versus Mcs-m

We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem is Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M, called MCS-M was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of chordal graphs, answering an open question mentioned by the authors of MCS-M.

M m m Queue with Balking, Reneging and Additional Servers

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...

مطالعه شونیت های کروماتی M M (Cro ) 6،H O M = NH ,Rb ,Cs ,…, M =Mg ,Ni ,…

M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...